Parallel algorithms for line detection on a mesh
نویسندگان
چکیده
منابع مشابه
Parallel Algorithms for Line Detection on a Mesh
We consider the problem of detecting lines in an nxn image on an nXn mesh of proceSSOI'S. We present two new and efficient algorithms which perform a Hough transform by pmjectioIL Our.fust algorithm runs in time 0 (k..r,n+n), where k and m are the number of 6and p-vaIues in the panunetric representation of the lines in the Hough transfonn, respectively. The second algorithm runs in O(n+k) time....
متن کاملParallel optimisation algorithms for multilevel mesh partitioning
Three parallel optimisation algorithms for use in the context of multilevel graph partitioning for unstructured meshes are described. The first, interface optimisation reduces the problem to a set of independent problems in interface regions. Alternating optimisation is restriction of this technique in which mesh entities are only allowed to migrate between subdomains in one direction. The thir...
متن کاملParallel Algorithms for Adaptive Mesh Refinement
Computational methods based on the use of adaptively constructed nonuniform meshes reduce the amount of computation and storage necessary to perform many scientiic calculations. The adaptive construction of such nonuniform meshes is an important part of these methods. In this paper, we present a parallel algorithm for adaptive mesh reenement that is suitable for implementation on distributed-me...
متن کاملOn-line Algorithms for a Parallel Job Scheduling Problem
In this paper, we consider a simple model for parallel job scheduling with computation and communication costs. For each job Jj with processing time pj , if kj processors are assigned to execute the job then the actual execution time of the job is pj=kj + kj , where the constant is the communication cost (or in general the overhead cost) associated with each processor. We define a scheduling pr...
متن کاملOptimal Parallel Algorithms for Multiselection on Mesh-Connected Computers
Multiselection is the problem of selecting multiple elements at specified ranks from a set of arbitrary elements. In this paper, we first present an efficient algorithm for single-element selection that runs in O( √ p+ np log p log(kp/n)) time for selecting the kth smallest element from n elements on a √ p × √p mesh-connected computer of p ≤ n processors, where the first component is for commun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 1989
ISSN: 0743-7315
DOI: 10.1016/0743-7315(89)90039-7